Visibility Preprocessing with Occluder Fusion for Urban Walkthroughs
نویسندگان
چکیده
This paper presents an efficient algorithm for occlusion culling of urban environments. It is conservative and accurate in finding all significant occlusion. It discretizes the scene into view cells, for which cell-to-object visibility is precomputed, making on-line overhead negligible. Unlike other precomputation methods for view cells, it is able to conservatively compute all forms of occluder interaction for an arbitrary number of occluders. To speed up preprocessing, standard graphics hardware is exploited and occluder occlusion is considered. A walkthrough application running an 8 million polygon model of the city of Vienna on consumer-level hardware illustrates our results.
منابع مشابه
Hierarchical Techniques for Visibility Computations
Visibility computation is crucial for computer graphics from its very beginning. The first visibility algorithms aimed to determine visible lines or surfaces in a synthesized image of a 3D scene. Nowadays there is a plethora of visibility algorithms for various applications. The thesis proposes a taxonomy of visibility problems based on the dimension of the problem-relevant line set, i.e. set o...
متن کاملOccluder Shadows for Fast Walkthroughs of Urban Environments
This paper describes a new algorithm that employs image-based rendering for fast occlusion culling in complex urban environments. It exploits graphics hardware to render and automatically combine a relatively large set of occluders. The algorithm is fast to calculate and therefore also useful for scenes of moderate complexity and walkthroughs with over 20 frames per second. Occlusion is calcula...
متن کاملHigh Fidelity Walkthroughs of Large Virtual Environments
This dissertation presents an out-of-core algorithm for high-fidelity walkthroughs of large virtual environments. A novel feature of our walkthrough system is that it performs work proportional only to the required detail in the visible geometry at the rendering time. To accomplish this, we partition the space of possible view-points into view-cells (or view-regions). We use a pre-computation p...
متن کاملHardware-Accelerated from-Region Visibility Using a Dual Ray Space
This paper describes a novel from-region visibility algorithm, the unique properties of which allow conducting remote walkthroughs in very large virtual environments, without preprocessing and storing prohibitive amounts of visibility information. The algorithm retains its speed and accuracy even when applied to large viewcells. This allows computing from-region visibility on-line, thus elimina...
متن کاملVisibility Preprocessing for Urban Scenes using Line Space Subdivision
We present an algorithm for visibility preprocessing of urban environments. The algorithm uses a subdivision of line space to analytically calculate a conservative potentially visible set for a given region in the scene. We present a detailed evaluation of our method including a comparison to another recently published visibility preprocessing algorithm. To the best of our knowledge the propose...
متن کامل